Recursion for structured modules
نویسنده
چکیده
This paper proposes an extension of the ML module system with recursion that keeps a flexible use of nested structures and functors. For the purpose of formal study, we design a calculus, called PathCal, which has a module system with nested structures and simple functors along with recursion. It is important for this calculus to guarantee resolvability of recursive references between modules. We present a decidable type system to ensure this resolvability.
منابع مشابه
High-level Structured Interactive Programs with Registers and Voices
A model (consisting of rv-systems), a core programming language (for developing rv-programs), several specification and analysis techniques appropriate for modeling, programming and reasoning about interactive computing systems have been introduced by Stefanescu in 2004 using register machines and space-time duality, see [Stefanescu 2006, Stefanescu 2006b]. Later on, Dragoi and Stefanescu have ...
متن کاملAutomatic Structuring of Programs
A method is described that allows the translation of a traditionally written (unstructured) program into a set of top-down structured, semantically founded, GoTo-free modules. The method reveals not nly the logic of a given program in a most natural way, but it also reduces code duplication to a minimum. It is further shown how the obtained structured program can be mapped back into a GOTO prog...
متن کاملMulti-Frame Vectors for Unitary Systems in Hilbert $C^{*}$-modules
In this paper, we focus on the structured multi-frame vectors in Hilbert $C^*$-modules. More precisely, it will be shown that the set of all complete multi-frame vectors for a unitary system can be parameterized by the set of all surjective operators, in the local commutant. Similar results hold for the set of all complete wandering vectors and complete multi-Riesz vectors, when the surjective ...
متن کاملRecursive Object-Oriented Modules
ML-style modules and classes are complementary. The former are better at structuring and genericity, the latter at extension and mutual recursion. We investigate the convergence of both mechanisms by designing an object-oriented calculus based on a nominal module system with mutual recursion. Our modules assume simultaneously the roles of classes with subtyping, nested structures with type memb...
متن کاملFirst-Class Modules for Haskell
Though Haskell’s module language is quite weak, its core language is highly expressive. Indeed, it is tantalisingly close to being able to express much of the structure traditionally delegated to a seperate module language. However, the encodings are awkward, and some situations can’t be encoded at all. In this paper we refine Haskell’s core language to support first-class modules with many of ...
متن کامل